Program Verification by Calculating Relations
نویسندگان
چکیده
We show how properties of an interesting class of imperative programs can be verifed by means of relational modelling and symbolic computation.
منابع مشابه
Synchronous set relations in rewriting logic
This paper presents a mathematical foundation and a rewriting logic infrastructure for the execution and property verification of synchronous set relations. The mathematical foundation is given in the language of abstract set relations. The infrastructure, which is written in the Maude system, enables the synchronous execution of a set relation provided by the user. By using the infrastructure,...
متن کاملRelational Refinement Types for Higher-Order Shape Transformers (Invited Talk)
Understanding, discovering, and proving useful properties of sophisticated data structures are central problems in program verification. A particularly challenging exercise for shape analyses involves reasoning about sophisticated shape transformers that preserve the shape of a data structure (e.g., the data structure skeleton is always maintained as a balanced tree) or the relationship among v...
متن کاملVerification of Procedural Programs via Building Their Generalized Nets Models
In the article an approach for verification of procedural programs via building their corresponding generalized nets models is described. This approach integrates the concept of “design by contract” with approaches for verification of type theorem proofs and models consistency check. For this purpose, functions which compose the program, are verified separately according to their specifications...
متن کاملOn Solving Universally Quantified Horn Clauses
Program proving can be viewed as solving for unknown relations (such as loop invariants, procedure summaries and so on) that occur in the logical verification conditions of a program, such that the verification conditions are valid. Generic logical tools exist that can solve such problems modulo certain background theories, and therefore can be used for program analysis. Here, we extend these t...
متن کاملOn the semantics of EPCs: Efficient calculation and simulation
One of the most debatable features of Event driven Process Chains (EPCs) is their non-local semantics, which results in some difficulties when defining a formal semantics for EPCs. Recently, we have overcome these problems by using techniques from fixed-point theory for the definition of the semantics for an EPC, which consists of a pair of related transition relations for each EPC. The fixed-p...
متن کامل